Testing the efficiency of two pairwise comparison methods in discrete multiple criteria problems

نویسندگان

  • Risto Lahdelma
  • Pekka Salminen
  • Markku Kuula
چکیده

We test the efficiency of two pairwise comparison methods. The methods studied are Salminen’s piecewise linear prospect theory (PLP) method and the convex cone method by Korhonen, Wallenius, and Zionts (KWZ). The PLP method is based on a piecewise linear difference function. The KWZ method assumes a quasi-concave utility or value function. These methods are tested using randomly generated data sets with 50, 100, 150, and 200 alternatives and from 2 up to 6 criteria. The DM’s preference statements are simulated using linear, quadratic, and Chebycheff value functions and piecewise linear difference functions. Both methods lose their efficiency very rapidly with increasing number of criteria. Our results indicate that pairwise comparison methods are not as efficient as reported in literature.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Determination of weight vector by using a pairwise comparison matrix based on DEA and Shannon entropy

The relation between the analytic hierarchy process (AHP) and data envelopment analysis (DEA) is a topic of interest to researchers in this branch of applied mathematics. In this paper, we propose a linear programming model that generates a weight (priority) vector from a pairwise comparison matrix. In this method, which is referred to as the E-DEAHP method, we consider each row of the pairwise...

متن کامل

Using Hybrid Fuzzy PROMETHEE II and Fuzzy Binary Goal Programming for Risk Ranking: A Case Study of Highway Construction Projects

Multi attribute decision making methods are considered as one of the most useful methods for solving ranking problems. In some decision making problems, while the alternatives for corresponding criteria are compared in a pairwise comparison manner, if the criteria are inherently fuzzy, debates will arise in ranking alternatives due to the closeness of the values of the criteria. In this researc...

متن کامل

A Common Weight Multi-criteria Decision analysis-data Envelopment Analysis Approach with Assurance Region for Weight Derivation from Pairwise Comparison Matrices

Deriving weights from a pairwise comparison matrix (PCM) is a subject for which a wide range of methods have ever been presented. This paper proposes a common weight multi criteria decision analysis-data envelopment analysis (MCDA-DEA) approach with assurance region for weight derivation from a PCM. The proposed model has several merits over the competing approaches and removes the drawbacks of...

متن کامل

EIGENVECTORS OF COVARIANCE MATRIX FOR OPTIMAL DESIGN OF STEEL FRAMES

In this paper, the discrete method of eigenvectors of covariance matrix has been used to weight minimization of steel frame structures. Eigenvectors of Covariance Matrix (ECM) algorithm is a robust and iterative method for solving optimization problems and is inspired by the CMA-ES method. Both of these methods use covariance matrix in the optimization process, but the covariance matrix calcula...

متن کامل

Ranking Bank Branches with Interval Data By IAHP and TOPSIS

This paper proposes a method for ranking decision making units (DMUs) using some of the multiple criteria decision making / multiple attribute decision making          (MCDM /MADM) techniques, namely, interval analytic hierarchy process (IAHP)          and the technique for order preference by similarity to an ideal solution (TOPSIS).          Since the efficiency score of unity is assigned to ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • European Journal of Operational Research

دوره 145  شماره 

صفحات  -

تاریخ انتشار 2003